Complete Set of CHC Tetrahedrons

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of fuzzy complete normed space and fuzzy b-complete set

The present paper introduces the notion of the complete fuzzy norm on a linear space. And, some relations between the fuzzy completeness and ordinary completeness on a linear space is considered, moreover a new form of fuzzy compact spaces, namely b-compact spaces and b-closed spaces are introduced. Some characterizations of their properties are obtained.

متن کامل

Properties of Coxeter Andreev’s Tetrahedrons

Abstract: Tetrahedron is the only 3-simplex convex polyhedron having four faces, and its shape has a wide application in science and technology. In this article, using graph theory and combinatorics, a study on a special type of tetrahedron called coxeter Andreev’s tetrahedron has been facilitated and it has been found that there are exactly one, four and thirty coxeter Andreev’s tetrahedrons h...

متن کامل

characterization of fuzzy complete normed space and fuzzy b-complete set

the present paper introduces the notion of the complete fuzzy norm on a linear space. and, some relations between the fuzzy completeness and ordinary completeness on a linear space is considered, moreover a new form of fuzzy compact spaces, namely b-compact spaces and b-closed spaces are introduced. some characterizations of their properties are obtained.

متن کامل

Random Walks of Tetrahedrons and Cubes

We show how to design the value of the diffusion constant D for the random walk of a tetrahedron in a face-centered cubic lattice, and for the random walk of a cube in a Cartesian lattice. As in previous work in two-dimensions, by allowing Null moves and movements to locations in the lattice other than nearest neighbors, we can design the value of the diffusion constant D to a value larger that...

متن کامل

Set - Theoretic Complete Intersection Monomial

In this paper we describe an algorithm for producing infinitely many examples of set-theoretic complete intersection monomial curves in P n+1 , starting with a single set-theoretic complete intersection monomial curve in P n. Moreover we investigate the numerical criteria to decide when these monomial curves can or cannot be obtained via semigroup gluing.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2014

ISSN: 0975-8887

DOI: 10.5120/15252-3891